AustralieFrV1, Main, Exploration, bibRecord, 006339

Resource Scheduling Methods for Query Optimization in Data Grid Systems

Identifieur interne : 006339 ( Main/Exploration ); précédent : 006338; suivant : 006340

Resource Scheduling Methods for Query Optimization in Data Grid Systems

Auteurs : Igor Epimakhov [France] ; Abdelkader Hameurlain [France] ; Tharam Dillon [Australie] ; Franck Morvan [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.

RBID : ISTEX:0C85C00C98EB57F2DD9AA7EA884EAC19BCDFA95B

Descripteurs français

Wicri :
- topic : Base de données, Modèle économique.

English descriptors

Abstract

Abstract: Resource allocation (RA) is one of the most important stages of distributed query processing in Data Grid systems. Recently, a number of papers that propose different methods for RA were published. To deal with specific characteristics of the data grid systems, such as dynamicity, heterogeneity and large-scale, many studies extend classic methods from distributed and parallel databases domains. Others invite fundamentally different methods based on incentives for autonomous nodes. The present study provides a brief description, qualitative comparison and performance evaluation of the most interesting approaches (extended classic and incentive-based) for RA. Both approaches are promising and appropriate for successful data grid systems.

Url:

https://api.istex.fr/document/0C85C00C98EB57F2DD9AA7EA884EAC19BCDFA95B/fulltext/pdf

DOI: 10.1007/978-3-642-23737-9_14

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 000247
to stream Istex, to step Curation: 000247
to stream Istex, to step Checkpoint: 000758
to stream Main, to step Merge: 006715
to stream Main, to step Curation: 006339

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Resource Scheduling Methods for Query Optimization in Data Grid Systems</title>
<author><name sortKey="Epimakhov, Igor" sort="Epimakhov, Igor" uniqKey="Epimakhov I" first="Igor" last="Epimakhov">Igor Epimakhov</name>
</author>
<author><name sortKey="Hameurlain, Abdelkader" sort="Hameurlain, Abdelkader" uniqKey="Hameurlain A" first="Abdelkader" last="Hameurlain">Abdelkader Hameurlain</name>
</author>
<author><name sortKey="Dillon, Tharam" sort="Dillon, Tharam" uniqKey="Dillon T" first="Tharam" last="Dillon">Tharam Dillon</name>
</author>
<author><name sortKey="Morvan, Franck" sort="Morvan, Franck" uniqKey="Morvan F" first="Franck" last="Morvan">Franck Morvan</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:0C85C00C98EB57F2DD9AA7EA884EAC19BCDFA95B</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-23737-9_14</idno>
<idno type="url">https://api.istex.fr/document/0C85C00C98EB57F2DD9AA7EA884EAC19BCDFA95B/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000247</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000247</idno>
<idno type="wicri:Area/Istex/Curation">000247</idno>
<idno type="wicri:Area/Istex/Checkpoint">000758</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000758</idno>
<idno type="wicri:doubleKey">0302-9743:2011:Epimakhov I:resource:scheduling:methods</idno>
<idno type="wicri:Area/Main/Merge">006715</idno>
<idno type="wicri:Area/Main/Curation">006339</idno>
<idno type="wicri:Area/Main/Exploration">006339</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Resource Scheduling Methods for Query Optimization in Data Grid Systems</title>
<author><name sortKey="Epimakhov, Igor" sort="Epimakhov, Igor" uniqKey="Epimakhov I" first="Igor" last="Epimakhov">Igor Epimakhov</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Institut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University, 118 Route de Narbonne, 31062, Toulouse</wicri:regionArea>
<placeName><region type="region" nuts="2">Occitanie (région administrative)</region>
<region type="old region" nuts="2">Midi-Pyrénées</region>
<settlement type="city">Toulouse</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Hameurlain, Abdelkader" sort="Hameurlain, Abdelkader" uniqKey="Hameurlain A" first="Abdelkader" last="Hameurlain">Abdelkader Hameurlain</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Institut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University, 118 Route de Narbonne, 31062, Toulouse</wicri:regionArea>
<placeName><settlement type="city">Toulouse</settlement>
<region type="region" nuts="2">Occitanie (région administrative)</region>
<region type="old region" nuts="2">Midi-Pyrénées</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Dillon, Tharam" sort="Dillon, Tharam" uniqKey="Dillon T" first="Tharam" last="Dillon">Tharam Dillon</name>
<affiliation wicri:level="1"><country xml:lang="fr">Australie</country>
<wicri:regionArea>DEBII Institute, Curtin University, Perth</wicri:regionArea>
<wicri:noRegion>Perth</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Australie</country>
</affiliation>
</author>
<author><name sortKey="Morvan, Franck" sort="Morvan, Franck" uniqKey="Morvan F" first="Franck" last="Morvan">Franck Morvan</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Institut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University, 118 Route de Narbonne, 31062, Toulouse</wicri:regionArea>
<placeName><settlement type="city">Toulouse</settlement>
<region type="region" nuts="2">Occitanie (région administrative)</region>
<region type="old region" nuts="2">Midi-Pyrénées</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2011</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Adaptive query processing</term>
<term>Algorithm</term>
<term>Allocation</term>
<term>Attributes relation size</term>
<term>Brief overview</term>
<term>Carvalho costa</term>
<term>Centralized approach</term>
<term>Centralized scheduler</term>
<term>Classic approach</term>
<term>Classic method</term>
<term>Common theme</term>
<term>Communication cost</term>
<term>Complex queries</term>
<term>Computational grids</term>
<term>Computational resources</term>
<term>Concurrency computat</term>
<term>Data grid</term>
<term>Data grid environment</term>
<term>Data grid nodes</term>
<term>Data grid simulator</term>
<term>Data grid system</term>
<term>Data grid systems</term>
<term>Database</term>
<term>Decentralized</term>
<term>Dependent operations support</term>
<term>Different methods</term>
<term>Dynamic reallocation</term>
<term>Economic model</term>
<term>Entire system</term>
<term>Epimakhov</term>
<term>Excellent scalability</term>
<term>Execution plan</term>
<term>Execution time</term>
<term>Full autonomy</term>
<term>Future generation computer systems</term>
<term>Good scalability</term>
<term>Grid</term>
<term>Grid environment</term>
<term>Grid system</term>
<term>Grid systems</term>
<term>Hierarchical model</term>
<term>Important factor</term>
<term>Important feature</term>
<term>Irop</term>
<term>Large number</term>
<term>Load balancing</term>
<term>Local nodes</term>
<term>Main approaches</term>
<term>Major parameters</term>
<term>Multiple queries</term>
<term>Multiquery scheduling</term>
<term>Node</term>
<term>Optimal number</term>
<term>Optimal resource allocation</term>
<term>Optimization</term>
<term>Parallel query processing</term>
<term>Parallelism</term>
<term>Performance evaluation</term>
<term>Physical operations</term>
<term>Pipeline parallelism</term>
<term>Query</term>
<term>Query execution</term>
<term>Query execution plan</term>
<term>Query optimization</term>
<term>Query plan</term>
<term>Query processing</term>
<term>Reallocation</term>
<term>Resource</term>
<term>Resource allocation</term>
<term>Resource allocation algorithm</term>
<term>Resource allocation algorithms</term>
<term>Resource allocation mechanism</term>
<term>Resource allocation methods</term>
<term>Resource allocation problem</term>
<term>Resource allocation time</term>
<term>Resource scheduling methods</term>
<term>Response time</term>
<term>Same time</term>
<term>Scalability</term>
<term>Scheduler</term>
<term>Scheduling</term>
<term>Talloc</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en"><term>Adaptive query processing</term>
<term>Algorithm</term>
<term>Allocation</term>
<term>Attributes relation size</term>
<term>Brief overview</term>
<term>Carvalho costa</term>
<term>Centralized approach</term>
<term>Centralized scheduler</term>
<term>Classic approach</term>
<term>Classic method</term>
<term>Common theme</term>
<term>Communication cost</term>
<term>Complex queries</term>
<term>Computational grids</term>
<term>Computational resources</term>
<term>Concurrency computat</term>
<term>Data grid</term>
<term>Data grid environment</term>
<term>Data grid nodes</term>
<term>Data grid simulator</term>
<term>Data grid system</term>
<term>Data grid systems</term>
<term>Database</term>
<term>Decentralized</term>
<term>Dependent operations support</term>
<term>Different methods</term>
<term>Dynamic reallocation</term>
<term>Economic model</term>
<term>Entire system</term>
<term>Epimakhov</term>
<term>Excellent scalability</term>
<term>Execution plan</term>
<term>Execution time</term>
<term>Full autonomy</term>
<term>Future generation computer systems</term>
<term>Good scalability</term>
<term>Grid</term>
<term>Grid environment</term>
<term>Grid system</term>
<term>Grid systems</term>
<term>Hierarchical model</term>
<term>Important factor</term>
<term>Important feature</term>
<term>Irop</term>
<term>Large number</term>
<term>Load balancing</term>
<term>Local nodes</term>
<term>Main approaches</term>
<term>Major parameters</term>
<term>Multiple queries</term>
<term>Multiquery scheduling</term>
<term>Node</term>
<term>Optimal number</term>
<term>Optimal resource allocation</term>
<term>Optimization</term>
<term>Parallel query processing</term>
<term>Parallelism</term>
<term>Performance evaluation</term>
<term>Physical operations</term>
<term>Pipeline parallelism</term>
<term>Query</term>
<term>Query execution</term>
<term>Query execution plan</term>
<term>Query optimization</term>
<term>Query plan</term>
<term>Query processing</term>
<term>Reallocation</term>
<term>Resource</term>
<term>Resource allocation</term>
<term>Resource allocation algorithm</term>
<term>Resource allocation algorithms</term>
<term>Resource allocation mechanism</term>
<term>Resource allocation methods</term>
<term>Resource allocation problem</term>
<term>Resource allocation time</term>
<term>Resource scheduling methods</term>
<term>Response time</term>
<term>Same time</term>
<term>Scalability</term>
<term>Scheduler</term>
<term>Scheduling</term>
<term>Talloc</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Base de données</term>
<term>Modèle économique</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Resource allocation (RA) is one of the most important stages of distributed query processing in Data Grid systems. Recently, a number of papers that propose different methods for RA were published. To deal with specific characteristics of the data grid systems, such as dynamicity, heterogeneity and large-scale, many studies extend classic methods from distributed and parallel databases domains. Others invite fundamentally different methods based on incentives for autonomous nodes. The present study provides a brief description, qualitative comparison and performance evaluation of the most interesting approaches (extended classic and incentive-based) for RA. Both approaches are promising and appropriate for successful data grid systems.</div>
</front>
</TEI>
<affiliations><list><country><li>Australie</li>
<li>France</li>
</country>
<region><li>Midi-Pyrénées</li>
<li>Occitanie (région administrative)</li>
</region>
<settlement><li>Toulouse</li>
</settlement>
</list>
<tree><country name="France"><region name="Occitanie (région administrative)"><name sortKey="Epimakhov, Igor" sort="Epimakhov, Igor" uniqKey="Epimakhov I" first="Igor" last="Epimakhov">Igor Epimakhov</name>
</region>
<name sortKey="Epimakhov, Igor" sort="Epimakhov, Igor" uniqKey="Epimakhov I" first="Igor" last="Epimakhov">Igor Epimakhov</name>
<name sortKey="Hameurlain, Abdelkader" sort="Hameurlain, Abdelkader" uniqKey="Hameurlain A" first="Abdelkader" last="Hameurlain">Abdelkader Hameurlain</name>
<name sortKey="Hameurlain, Abdelkader" sort="Hameurlain, Abdelkader" uniqKey="Hameurlain A" first="Abdelkader" last="Hameurlain">Abdelkader Hameurlain</name>
<name sortKey="Morvan, Franck" sort="Morvan, Franck" uniqKey="Morvan F" first="Franck" last="Morvan">Franck Morvan</name>
<name sortKey="Morvan, Franck" sort="Morvan, Franck" uniqKey="Morvan F" first="Franck" last="Morvan">Franck Morvan</name>
</country>
<country name="Australie"><noRegion><name sortKey="Dillon, Tharam" sort="Dillon, Tharam" uniqKey="Dillon T" first="Tharam" last="Dillon">Tharam Dillon</name>
</noRegion>
<name sortKey="Dillon, Tharam" sort="Dillon, Tharam" uniqKey="Dillon T" first="Tharam" last="Dillon">Tharam Dillon</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006339 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006339 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:0C85C00C98EB57F2DD9AA7EA884EAC19BCDFA95B
   |texte=   Resource Scheduling Methods for Query Optimization in Data Grid Systems
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur les relations entre la France et l'Australie

Resource Scheduling Methods for Query Optimization in Data Grid Systems

Resource Scheduling Methods for Query Optimization in Data Grid Systems

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri